The Boolean formula value problem is in ALOGTIME (Preliminary Version)
نویسنده
چکیده
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value problem is complete for alternating log time under deterministic log time reductions. Consequently, it is also complete for alternating log time under AC reductions.
منابع مشابه
Algorithms for Boolean Formula Evaluation and for Tree Contraction
This paper presents a new, simpler ALOGTIME algorithm for the Boolean sentence value problem (BSVP). Unlike prior work, this algorithm avoids the use of postfix-longer-operand-first formulas. This paper also shows that tree-contraction can be made ALOGTIME
متن کاملThe Complexity of the Boolean Formula Value Problem
We examine the complexity of the formula value problem for Boolean formulas, which is the following decision problem: Given a Boolean formula without variables, does it evaluate to true? We show that the complexity of this problem is determined by certain closure properties of the connectives allowed to build the formula, and achieve a complete classification: The formula value problem is eithe...
متن کاملGame-SAT: A Preliminary Report
Game-SAT is a 2-player version of SAT where two players (MAX and MIN) play on a SAT instance by alternatively selecting a variable and assigning it a value true or false. MAX tries to make the formula true, while MIN tries to make it false. The Game-SAT problem is to determine the winner of a SAT instance under the rules above, assuming the perfect play by both players. The Game-SAT problem, or...
متن کاملDValue for Boolean games is EXP-complete
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean gameG determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in [1]. 1 Preliminaries We will be using the encoding of [2] to replicate the proof of [1]. A familiarity with [2] will make the proof much easier t...
متن کاملThe equivalence of theories that characterize ALogTime
A number of theories have been developed to characterize ALogTime (or uniform NC, or just NC), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory S12 characterizes polytime functions. Among these, ALV ′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation gro...
متن کامل